Path Finding with the Sweep - Line
نویسنده
چکیده
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملOptimal Line-sweep-based Decompositions for Coverage Algorithms
Robotic coverage is the problem of moving a sensor or actuator over all points in a given region. Ultimately, we want a coverage path that minimizes some cost such as time. We take the approach of decomposing the coverage region into subregions, selecting a sequence of those subregions, and then generating a path that covers each subregion in turn. In this paper, we focus on generating decompos...
متن کاملPii: S0010-4485(99)00080-9
Presented in the paper is a tool-path planning algorithm for direction-parallel area milling consisting of three modules: (1) finding the optimal inclination; (2) calculating and storing tool-path elements; and (3) tool-path linking. For the optimal inclination, we suggest an algorithm that selects an inclination by reflecting the shape of the machining area as well as the tool-path interval. W...
متن کاملOptimal Underwater Coverage of a Cellular Region by Autonomous Underwater Vehicle Using Line Sweep Motion
An underwater planar covering problem is studied where the coverage region consists of polygonal cells, and line sweep motion is used for coverage. In many subsea applications, sidescan sonar has become a common tool, and the sidescan sonar data is meaningful only when the sonar is moving in a straight line. This work studies the optimal line sweep coverage where the sweep paths of the cells co...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کامل